Cognitive Rhythms Reluctantly Revisited

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Humans Learn Using Manifolds, Reluctantly

When the distribution of unlabeled data in feature space lies along a manifold, the information it provides may be used by a learner to assist classification in a semi-supervised setting. While manifold learning is well-known in machine learning, the use of manifolds in human learning is largely unstudied. We perform a set of experiments which test a human’s ability to use a manifold in a semis...

متن کامل

Cognitive Metaphor Theory Revisited

This paper provides a framework which, being compatible with Lakoff and Johnson’s theory (1980), allows a description of metaphoric verbal utterances. The development of this theoretical expansion is encouraged by Lakoff and Johnson’s distinction between nonliteral and literal metaphoric expressions, and by the fact that they do not provide an explanation of the nonliteral metaphoric use of exp...

متن کامل

“Resistant” Channels Reluctantly Reveal Their Roles

tical pathfinding. Thus, axons from the VL, which nor-domain protein control of the expression of EphA recep-mally project to the rostral cortex (motor cortex), target tor and ephrin-A ligands in motor neurons and limb mes-instead the parietal cortex (somatosensory cortex; cau-enchymal cells, respectively. It will be of interest to see dal to the motor cortex) in the absence of ephrin-A5 and wh...

متن کامل

Neurosystems: brain rhythms and cognitive processing

Neuronal rhythms are ubiquitous features of brain dynamics, and are highly correlated with cognitive processing. However, the relationship between the physiological mechanisms producing these rhythms and the functions associated with the rhythms remains mysterious. This article investigates the contributions of rhythms to basic cognitive computations (such as filtering signals by coherence and/...

متن کامل

QUICKSELECT Revisited

We give an overview of the running time analysis of the random divide-and-conquer algorithm FIND or QUICKSELECT. The results concern moments, distribution of FIND’s running time, the limiting distribution, a stochastic bound and the key: a stochastic fixed point equation.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Language and Speech

سال: 1985

ISSN: 0023-8309,1756-6053

DOI: 10.1177/002383098502800106